Simultaneous eating algorithm and greedy algorithm in assignment problems

Abstract The simultaneous eating algorithm (SEA) and probabilistic serial (PS) mechanism are well known for allocating a set of divisible or indivisible goods to agents with ordinal preferences. PS is SEA at the same speed. prominent property efficiency. Recently, we extended (EPS) from fixed quota each good variable varying in polytope constrained by submodular functions. In this article, further generalized some results on SEA. After formalizing ESA (ESEA), show that it can be characterized We established stronger summation optimization than Pareto type efficiency an introduced weight vector. weights coincide agents’ preferences acyclic positive values allocation. Hence, order selected eat ESEA exactly one chosen execution well-known greedy algorithm.